Fast Algorithm for the 3-D DCT-II

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast algorithm for the 3D DCT

The three-dimensional discrete cosine transform (3D DCT) has been used in many 3-D applications such as video coding and compression. Many fast algorithms have been developed for the calculation of 1-D DCT. These algorithms are then used for the calculation of 3-D DCT using the row-column approach. However, 3-D algorithms involve less arithmetic operations and can be faster. In this paper, the ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A Fast Algorithm for DCT Domain Filtering

A method is developed and proposed to e ciently implement spatial domain ltering directly on compressed digital video and images in the discrete cosine transform (DCT) domain. It is demonstrated that the computational complexity of this method is signi cantly smaller than that of the straightforward approach, of converting back to the uncompressed domain, convolving in the spatial domain, and r...

متن کامل

A Fast Algorithm for Resizing Images in the DCT Domain

Abstract For many applications such as image transmission over channels with variable bandwidths and image display on devices at different resolution levels, image resizing is widely demanding. Recently, image resizing algorithms in the compressed domain have drawn a lot of attention to computation efficiency. In this paper, an efficient image resizing algorithm based on discrete cosine transfo...

متن کامل

A Fast DCT Block Smoothing Algorithm S

e o When errors are clearly visible, the blockiness of some artifacts distinguishes them from th riginal image content, suggesting a way of reducing these artifacts. Presumably, the human viewer k e identifies the artifacts by assuming the image does not have 8-pixel by 8-pixel block features. Bloc dge variance, the sum of squared differences between adjacent block edge pixels, is one simple s ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2004

ISSN: 1053-587X

DOI: 10.1109/tsp.2004.823472